PackLib: An Integrated Library of Multi-Dimensional Packing Problems
نویسندگان
چکیده
We present PackLib, the first fully integrated benchmark library for multi-dimensional packing instances. PackLib combines a systematic collection of all benchmark instances from previous literature with a well-organized set of new and challenging large instances. The XML format allows linking basic benchmark data with other important properties, like bibliographic information, origin, best known solutions, runtimes, etc. Transforming instances into a variety of existing input formats is also quite easy, as the XML format lends itself to easy conversion; for this purpose, a number of parsers are provided. Thus, PackLib aims at becoming a one-stop location for the packing and cutting community: In addition to fair and easy comparison of algorithmic work and ongoing measurement of scientific progress, it poses numerous challenges for future research.
منابع مشابه
PackLib 2 : An integrated library of multi - dimensional packing problems q
We present PackLib, the first fully integrated benchmark library for multi-dimensional packing instances. PackLib combines a systematic collection of all benchmark instances from previous literature with a well-organized set of new and challenging large instances. The XML format allows linking basic benchmark data with other important properties, like bibliographic information, origin, best kno...
متن کاملPackLib2: An integrated library of multi-dimensional packing problems
We present PackLib, the first fully integrated benchmark library for multi-dimensional packing instances. PackLib combines a systematic collection of all benchmark instances from previous literature with a well-organized set of new and challenging large instances. The XML format allows linking basic benchmark data with other important properties, like bibliographic information, origin, best kno...
متن کاملAn Interval Graph-based Tabu Search Framework for Multi-dimensional Packing
Packing is a vast and continuously growing field in the area of Operations Research and Combinatorial Optimization. Roughly speaking, given a set of items and a set of containers, packing problems are concerned with the loading of the items into the containers, according to some packing rules and optimizing a performance measure. Under this broad definition, we find a wide set of real-life and ...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملMulti-Dimensional Packing by Tabu Search
The paper deals with multi-dimensional cutting and packing and metaheuristic algorithms. A brief overview of this area is presented, and the general Tabu Search framework of Lodi, Martello and Vigo [LMV99a] is considered in detail. Computational results on multi-dimensional bin packing problems are reported, and possible methods for extending the framework to other packing problems are finally ...
متن کامل